例句與造句

1. From the elliptic curve you construct a finite group whose associated discrete log problem is ( believed to be ) hard.
2. In a seminal work, he showed that the Diffie-Hellman problem is ( under certain conditions ) equivalent to solving the discrete log problem.
3. Two parties, Alice and Bob, agree on a group G with generator g of prime order q in which the discrete log problem is hard.
4. In fact, both the integer factorization and discrete log problems are in NP ) " coNP, and are therefore not believed to be NP-complete.
5. The discrete logarithm problem is the basis for believing some other cryptosystems are secure, and again, there are related, less practical systems that are provably secure relative to the discrete log problem.
6. It's difficult to find discrete log problem in a sentence. 用discrete log problem造句挺難的
7. As estimated by the authors behind the Logjam attack, the much more difficult precomputation needed to solve the discrete log problem for a 1024-bit prime would cost on the order of $ 100 million, well within the budget of large national intelligence agency such as the U . S . National Security Agency ( NSA ).
8. What you'll want from the finite group in addition is that the discrete log problem becomes sufficiently hard without involving arithmetic of numbers that are too large . ( The larger the numbers, the slower the arithmetic . ) What elliptic curves give you is a way to construct finite groups that ( are believed to ) have such properties.
9. 7 ) In elliptic curve cryptography, the Weil descent attack uses the Weil restriction to transform a discrete logarithm problem on an elliptic curve over a finite extension field L / K, into a discrete log problem on the Jacobian variety of a hyperelliptic curve over the base field K, that is potentially easier to solve because of K's smaller size.
10. :: : In real applications ( as opposed to toy examples for illustrating the calculations ), the parameters " g " and " p " are of such sizes that solving the discrete log problem by exhaustive search is infeasible ( and, for that matter, the parameters sizes are chosen such that the solving problem remains infeasible even with the most efficient discrete log algorithms known ).